马克思主义世界观方法论在军事领域的生动运用与集中体现--学习胡主席关于新世纪新阶段我军历史使命的重要论述

胡锦涛主席关于新世纪新阶段我军历史使命的重要论述,是马克思主义世界观方法论在军事领域的生动运用和集中体现。学习理解新世纪新阶段我军历史使命,重在掌握蕴含其中的马克思主义立场、观点和方法,学习胡主席从党的事业、国家发展、人民利益出发思考国防和军队建设的政治立场,着眼世界发展大势处理军事问题的宽广视野,注重整体推进和重点突破相统一全面加强军队建设的科学方法,求真务实地推进国防和军队建设的科学精神。     

基于FEM/SPH算法的弹丸侵彻土体数值模拟

基于有限元法(FEM)和光滑粒子流体动力学(SPH)结合的算法,用数值模拟了钢质弹丸对钢筒约束土体的侵彻过程。基于ANSYS/LS-DYNA显式动力分析和LS-PrePost后处理软件,形象再现了钢质弹丸冲击作用下土体飞溅形成漏斗坑和直线通道的物理过程。侵彻深度计算结果与实验数据吻合较好,钢质弹丸的速度和加速度时程曲线图与理论分析一致,体现了FEM/SPH算法的精确性。研究结果表明FEM/SPH算法在模拟侵彻土体方面具有可行性和有效性。     

钢丝增强复合条带抗弹性能数值分析

为研究钢丝增强聚合物基复合条带的抗弹性能,基于冲击动力学理论分析其抗弹机理,再借助ANSYS/LS-DYNA软件和LS-PrePost前后处理器模拟有无增强钢丝2种工况下,条带对7.62 mm弹体的冲击响应。分析表明：条带的弹性模量、剪切模量和面密度会影响其能量吸收性能,能量吸收量随三者的增大而增大;由于聚合物基体的正交各向异性,应力云图显示出扁平椭圆状是合理的;在聚合物基复合条带中嵌入增强钢丝对条带整体的抗弹性能有积极的影响,但嵌入过量的钢丝会导致重量和成本的增加,因此需要对合理的钢丝配比率作进一步研究。研究结果可为钢丝增强聚合物基复合条带在野战防护结构中的应用提供参考。     

钢管在冲击荷载作用下的变形与失效破坏

为研究钢管在弹体侵彻过程中的变形特点,基于ANSYS/LS-DYNA软件,采用Johnson-Cook模型,模拟了半球形弹体以不同速度正向冲击钢管时的非线性动力响应情况。结果表明：弹体速度越小,钢管的抗侵彻性能越好;弹体速度越接近临界破坏速度,钢管降低弹体速度的能力就越明显;弹体冲击钢管时,钢管上表面比下表面更容易产生大变形,消耗更多的弹体动能,并在抗侵彻过程中伴有局部凹陷、蝶形变形和贯穿现象。实验结果可为圆柱壳结构钢管在冲击荷载作用下的耗能分析提供参考。     

LCDP SO算法在协同空战攻击决策中的运用?

为了探索提高协同空战攻击决策算法性能的途径,将多子群粒子群优化理论用于求解协同空战攻击决策,利用生命周期粒子群模型（ LCPSO）,提出了一种生命周期离散粒子群（ LCDPSO）协同空战攻击决策算法。基于典型空战想定背景,仿真验证了算法的有效性。通过统计实验的方法,分析比较了LCDPSO协同空战攻击决策算法与多种智能决策算法的准确性、可靠性和快速性,研究结果证明LCDPSO协同空战攻击决策算法优良的综合性能。     

自由曲面的立体视觉测量与加工一体化研究

对自由曲面的立体现觉测量与加工一体化技术中的图像匹配、曲面造型以及接口设计等问题进行了分析与讨论,并提出了切实可行的解决办法。     

Weighted vertex packing problem for specially structured geometric graphs

Consider a set of vertices V = {1, 2,…, n} placed on a two-dimensional Euclidean plane R² with each vertex attached a nonnegative weight w: V → R. For a given constant d>0, the geometric graph G = (V, E) is defined to have edge set E = {(i, j): d_ij ⩽ d} with d_ij being the Euclidean distance between vertices i and j. The geometric vertex packing (GVP) problem, which is often called the independent set problem, is defined as selecting the set of pairwise nonadjacent vertices with maximum total weight. We limit our attention to the special case that no vertex is within a distance βd of any other vertices where 0 ⩽ β < 1. A special value of β (= 1/2) is referred to frequently because of its correspondence to a manufacturing problem in circuit board testing. In this article we show that the weighted vertex packing problem for the specially structured geometric graph (SGVP) defined with the above restriction is NP-complete even for the case that all vertex weights are unity and for any β. Polynomial procedures have been designed for generating cuts to obtain tight LP upper bounds for the SGVP. Two heuristics with bounded worst-case performance are applied to the LP solution to produce a feasible solution and a lower bound. We then use a branch-and-bound procedure to solve the problem to optimality. Computational results on large-scale SGVP problems will be discussed. © 1995 John Wiley & Sons, Inc.     

Branch‐and‐price‐and‐cut for the manpower routing problem with synchronization constraints

In this article, we propose a branch‐and‐price‐and‐cut (BPC) algorithm to exactly solve the manpower routing problem with synchronization constraints (MRPSC). Compared with the classical vehicle routing problems (VRPs), the defining characteristic of the MRPSC is that multiple workers are required to work together and start at the same time to carry out a job, that is, the routes of the scheduling subjects are dependent. The incorporation of the synchronization constraints increases the difficulty of the MRPSC significantly and makes the existing VRP exact algorithm inapplicable. Although there are many types of valid inequalities for the VRP or its variants, so far we can only adapt the infeasible path elimination inequality and the weak clique inequality to handle the synchronization constraints in our BPC algorithm. The experimental results at the root node of the branch‐and‐bound tree show that the employed inequalities can effectively improve the lower bound of the problem. Compared with ILOG CPLEX, our BPC algorithm managed to find optimal solutions for more test instances within 1 hour. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 138–171, 2016     

某型自动榴弹发射器弹链节断裂原因诊断及对策

某型自动榴弹发射器弹链节在进行可靠性试验时出现断裂，通过现场信息收集和理化试验分析，对断裂原因进行准确诊断，提出了行之有效的应对对策，杜绝了弹链节断裂的重复发生。     

求解非对称线性方程组的 s-BiCR算法

在BiCR算法的基础上,提出了求解非对称线性方程组的s-BiCR算法。首先,给出了s-BiCR的基本计算框架,介绍了算法基本原理及参数求解方法;其次,通过分析s-BiCR中剩余向量与方向向量序列的基本性质,推导出减少参数求解计算量的方法,并在此基础上提出了一种更为高效的s-BiCR算法;最后,证明了s-BiCR的正确性,即在第i步产生的近似解与BiCR第is步产生的近似解是一致的,同时,通过性能分析发现,s-BiCR的同步通信次数与访存次数明显少于BiCR,说明该算法具有很好的并行特性和数据本地性。大量实验验证了s-BiCR的高效性和正确性。